A fast and reliable algorithm for evaluating nth order pentadiagonal determinants

نویسنده

  • Moawwad E. A. El-Mikkawy
چکیده

In the current article we present a fast and reliable algorithm for evaluating nth order pentadiagonal determinants in linear time. It is a natural generalization of the DETGTRI algorithm [M. El-Mikkawy, A fast algorithm for evaluating nth order tri-diagonal determinants, J. Comput. Appl. Math. 166 (2004) 581–584]. The algorithm is suited for implementation using computer algebra systems (CAS) such as MACSYMA and MAPLE. Some illustrative examples are given. 2008 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A computational algorithm for special nth-order pentadiagonal Toeplitz determinants

In this short note, we present a fast and reliable algorithm for evaluating special nth-order pentadiagonal Toeplitz determinants in linear time. The algorithm is suited for implementation using Computer Algebra Systems (CAS) such as MACSYMA and MAPLE. Two illustrative examples are given. 2007 Elsevier Inc. All rights reserved.

متن کامل

Inversion of general tridiagonal matrices

In the current work, the authors present a symbolic algorithm for finding the inverse of any general nonsingular tridiagonal matrix. The algorithm is mainly based on the work presented in [Y. Huang, W.F. McColl, Analytic inversion of general tridiagonal matrices, J. Phys. A 30 (1997) 7919–7933] and [M.E.A. El-Mikkawy, A fast algorithm for evaluating nth order tridiagonal determinants, J. Comput...

متن کامل

On Solving Pentadiagonal Linear Systems via Transformations

Many authors studied numeric algorithms for solving the linear systems of the pentadiagonal type. The well-known Fast Pentadiagonal System Solver algorithm is an example of such algorithms. The current article is describes new numeric and symbolic algorithms for solving pentadiagonal linear systems via transformations. New algorithms are natural generalization of the work presented in [Moawwad ...

متن کامل

A parallel method for solving pentadiagonal systems of linear equations

A new parallel approach for solving a pentadiagonal linear system is presented. The parallel partition method for this system and the TW parallel partition method on a chain of P processors are introduced and discussed. The result of this algorithm is a reduced pentadiagonal linear system of order P 2 compared with a system of order 2P 2 for the parallel partition method. More importantly the n...

متن کامل

Symbolic algorithm for inverting cyclic pentadiagonal matrices recursively - Derivation and implementation

In this paper, by using parallel computing along with recursion, we describe a reliable symbolic computational algorithm for inverting cyclic pentadiagonal matrices. The algorithm is implemented in MAPLE. Two other symbolic algorithms are developed and the computational costs for all algorithms are given. An example is presented for the sake of illustration. © 2009 Elsevier Ltd. All rights rese...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 202  شماره 

صفحات  -

تاریخ انتشار 2008